Cellular automata and communication complexity
نویسندگان
چکیده
منابع مشابه
Cellular automata and communication complexity
The model of cellular automata is fascinating because very simple local rules can generate complex global behaviors. The relationship between local and global function is subject of many studies. We tackle this question by using results on communication complexity theory and, as a by-product, we provide (yet another) classification of cellular automata.
متن کاملTraced communication complexity of cellular automata
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the central cell will ever reach a particular state. We present some links with classical dynamical concepts, and give the asymptotic communication complexity of many elementary cellular automata.
متن کاملCommunication complexity and intrinsic universality in cellular automata
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication complexity of various “canonical problems” related to the dynamics of F . We show that the intrinsic universality of F implies high communication complexity for each of the canonical problems. This result allows us to rul...
متن کاملCommunication complexity in number-conserving and monotone cellular automata
One third of the elementary cellular automata (CAs) are either number-conserving (NCCAs) or monotone (increasing or decreasing). In this paper we prove that, for all of them, we can find linear or constant communicationprotocols for thepredictionproblem. In otherwords, we are able to give a succinct description for their dynamics. This is not necessarily true for general NCCAs. In fact, we also...
متن کاملKolmogorov Complexity and Cellular Automata Classiication Ecole Normale Supérieure De Lyon Kolmogorov Complexity and Cellular Automata Classiication Kolmogorov Complexity and Cellular Automata Classiication
We present a new approach to cellular automata (CA for short) classiica-tion based on algorithmic complexity. We construct a parameter which is based only on the transition table of CA and measures the \randomness" of evolutions; is better, in a certain sense, than any other parameter deened on rule tables. We investigate the relations between the classical approach based on topology and ours b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.03.017